Inequalities for a Classical Eigenvalue Problem
نویسندگان
چکیده
منابع مشابه
Isoperimetric Inequalities for a Nonlinear Eigenvalue Problem
An estimate for the spectrum of the two-dimensional eigenvalue problem Am + Xe" = 0 in D (X > 0), u = 0 on 3 D is derived, and upper and lower pointwise bounds for the solutions are constructed. 1. Let D be a simply connected bounded domain in the plane with a piecewise analytic boundary 3D. Consider the nonlinear Dirichlet problem Am(x) + Xe"w = 0 in D, (1) u(x) = 0 on dD, where X is a positiv...
متن کاملThe Embedded Eigenvalue Problem for Classical Groups
We report briefly on an endoscopic classification of representations by focusing on one aspect of the problem, the question of embedded Hecke eigenvalues. 1. The problem for G By “eigenvalue”, we mean the family of unramified Hecke eigenvalues of an automorphic representation. The question is whether there are any eigenvalues for the discrete spectrum that are also eigenvalues for the continuou...
متن کاملClassical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem
We study the approximation of the smallest eigenvalue of a Sturm-Liouville problem in the classical and quantum settings. We consider a univariate Sturm-Liouville eigenvalue problem with a nonnegative function q from the class C2([0, 1]) and study the minimal number n(ε) of function evaluations or queries that are necessary to compute an ε-approximation of the smallest eigenvalue. We prove that...
متن کاملA linear eigenvalue algorithm for the nonlinear eigenvalue problem
The Arnoldi method for standard eigenvalue problems possesses several attractive properties making it robust, reliable and efficient for many problems. Our first important result is a characterization of a general nonlinear eigenvalue problem (NEP) as a standard but infinite dimensional eigenvalue problem involving an integration operator denoted B. In this paper we present a new algorithm equi...
متن کاملEigenvalue inequalities for graphs and convex subgraphs
For an induced subgraph S of a graph, we show that its Neumann eigenvalue λS can be lower-bounded by using the heat kernel Ht(x, y) of the subgraph. Namely, λS ≥ 1 2t ∑ x∈S inf y∈S Ht(x, y) √ dx √ dy where dx denotes the degree of the vertex x. In particular, we derive lower bounds of eigenvalues for convex subgraphs which consist of lattice points in an d-dimensional Riemannian manifolds M wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 1954
ISSN: 0022-2518
DOI: 10.1512/iumj.1954.3.53036